The Evolution of the Minimum Degree Ordering Algorithm
نویسندگان
چکیده
منابع مشابه
An Approximate Minimum Degree Ordering Algorithm
An Approximate Minimum Degree ordering algorithm (AMD) for preordering a symmetric sparse matrix prior to numerical factorization is presented. We use techniques based on the quotient graph for matrix factorization that allow us to obtain computationally cheap bounds for the minimum degree. We show that these bounds are often equal to the actual degree. The resulting algorithm is typically much...
متن کاملformation and evolution of regional organizations: the case study of the economic cooperation organization (eco)
abstract because of the many geopolitical, geo economical and geo strategically potentials and communicational capabilities of eco region, members can expand the convergence and the integration in base of this organization that have important impact on members development and expanding peace in international and regional level. based on quality analyzing of library findings and experts interv...
15 صفحه اولAlgorithm 8xx: AMD, an approximate minimum degree ordering algorithm
AMD is a set of routines for permuting sparse matrices prior to numerical factorization, using the approximate minimum degree ordering algorithm. There are versions written in both C and Fortran 77. A MATLAB interface is included.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 1989
ISSN: 0036-1445,1095-7200
DOI: 10.1137/1031001